0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.34 % Computer : n021.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1200 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Jul 13 11:08:40 EDT 2021 0.12/0.34 % CPUTime : 0.12/0.34 % Number of cores: 8 0.12/0.35 % Python version: Python 3.6.8 0.12/0.35 # Version: 2.6rc1-ho 0.12/0.35 # No SInE strategy applied 0.12/0.35 # Trying AutoSched0 for 59 seconds 0.12/0.38 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S00A 0.12/0.38 # and selection function NoSelection. 0.12/0.38 # 0.12/0.38 # Preprocessing time : 0.029 s 0.12/0.38 # Presaturation interreduction done 0.12/0.38 0.12/0.38 # Proof found! 0.12/0.38 # SZS status Theorem 0.12/0.38 # SZS output start CNFRefutation 0.12/0.38 thf(cSILLYWFF, conjecture, (?[X1:$i > $o, X2:$i > $o, X3:$i, X4:$i]:(((~(X2 @ z)&X1 @ X3)&~(X1 @ X4))&X2 @ X4)<=?[X1:$i > $o, X2:$i > $o, X3:$i, X4:$i]:(((X1 @ X3&~(X1 @ X4))&X2 @ X4)&~(X2 @ z))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cSILLYWFF)). 0.12/0.38 thf(c_0_1, negated_conjecture, ~((?[X1:$i > $o, X2:$i > $o, X3:$i, X4:$i]:(((X1 @ X3&~X1 @ X4)&X2 @ X4)&~X2 @ z)=>?[X1:$i > $o, X2:$i > $o, X3:$i, X4:$i]:(((~X2 @ z&X1 @ X3)&~X1 @ X4)&X2 @ X4))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cSILLYWFF])])). 0.12/0.38 thf(c_0_2, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X19:$i, X20:$i]:((((epred1_0 @ esk1_0&~epred1_0 @ esk2_0)&epred2_0 @ esk2_0)&~epred2_0 @ z)&(X18 @ z|~X17 @ X19|X17 @ X20|~X18 @ X20)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.12/0.38 thf(c_0_3, negated_conjecture, ~epred1_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_2])). 0.12/0.38 thf(c_0_4, negated_conjecture, ![X1:$i > $o, X3:$i, X2:$i > $o, X4:$i]:(X1 @ z|X2 @ X4|~X2 @ X3|~X1 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.12/0.38 thf(c_0_5, negated_conjecture, ![X3:$i, X1:$i > $o]:(X1 @ z|~epred1_0 @ X3|~X1 @ esk2_0), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.12/0.38 thf(c_0_6, negated_conjecture, epred1_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_2])). 0.12/0.38 thf(c_0_7, negated_conjecture, ![X1:$i > $o]:(X1 @ z|~X1 @ esk2_0), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.12/0.38 thf(c_0_8, negated_conjecture, epred2_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_2])). 0.12/0.38 thf(c_0_9, negated_conjecture, ~epred2_0 @ z, inference(split_conjunct,[status(thm)],[c_0_2])). 0.12/0.38 thf(c_0_10, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), ['proof']). 0.12/0.38 # SZS output end CNFRefutation 0.12/0.38 # Proof object total steps : 11 0.12/0.38 # Proof object clause steps : 8 0.12/0.38 # Proof object formula steps : 3 0.12/0.38 # Proof object conjectures : 11 0.12/0.38 # Proof object clause conjectures : 8 0.12/0.38 # Proof object formula conjectures : 3 0.12/0.38 # Proof object initial clauses used : 5 0.12/0.38 # Proof object initial formulas used : 1 0.12/0.38 # Proof object generating inferences : 3 0.12/0.38 # Proof object simplifying inferences : 1 0.12/0.38 # Training examples: 0 positive, 0 negative 0.12/0.38 # Parsed axioms : 2 0.12/0.38 # Removed by relevancy pruning/SinE : 0 0.12/0.38 # Initial clauses : 6 0.12/0.38 # Removed in clause preprocessing : 1 0.12/0.38 # Initial clauses in saturation : 5 0.12/0.38 # Processed clauses : 12 0.12/0.38 # ...of these trivial : 0 0.12/0.38 # ...subsumed : 0 0.12/0.38 # ...remaining for further processing : 12 0.12/0.38 # Other redundant clauses eliminated : 0 0.12/0.38 # Clauses deleted for lack of memory : 0 0.12/0.38 # Backward-subsumed : 1 0.12/0.38 # Backward-rewritten : 0 0.12/0.38 # Generated clauses : 16 0.12/0.38 # ...of the previous two non-trivial : 13 0.12/0.38 # Contextual simplify-reflections : 0 0.12/0.38 # Paramodulations : 16 0.12/0.38 # Factorizations : 0 0.12/0.38 # NegExts : 0 0.12/0.38 # Equation resolutions : 0 0.12/0.38 # Propositional unsat checks : 0 0.12/0.38 # Propositional check models : 0 0.12/0.38 # Propositional check unsatisfiable : 0 0.12/0.38 # Propositional clauses : 0 0.12/0.38 # Propositional clauses after purity: 0 0.12/0.38 # Propositional unsat core size : 0 0.12/0.38 # Propositional preprocessing time : 0.000 0.12/0.38 # Propositional encoding time : 0.000 0.12/0.38 # Propositional solver time : 0.000 0.12/0.38 # Success case prop preproc time : 0.000 0.12/0.38 # Success case prop encoding time : 0.000 0.12/0.38 # Success case prop solver time : 0.000 0.12/0.38 # Current number of processed clauses : 6 0.12/0.38 # Positive orientable unit clauses : 2 0.12/0.38 # Positive unorientable unit clauses: 0 0.12/0.38 # Negative unit clauses : 2 0.12/0.38 # Non-unit-clauses : 2 0.12/0.38 # Current number of unprocessed clauses: 11 0.12/0.38 # ...number of literals in the above : 48 0.12/0.38 # Current number of archived formulas : 0 0.12/0.38 # Current number of archived clauses : 6 0.12/0.38 # Clause-clause subsumption calls (NU) : 1 0.12/0.38 # Rec. Clause-clause subsumption calls : 1 0.12/0.38 # Non-unit clause-clause subsumptions : 1 0.12/0.38 # Unit Clause-clause subsumption calls : 0 0.12/0.38 # Rewrite failures with RHS unbound : 0 0.12/0.38 # BW rewrite match attempts : 0 0.12/0.38 # BW rewrite match successes : 0 0.12/0.38 # Condensation attempts : 0 0.12/0.38 # Condensation successes : 0 0.12/0.38 # Termbank termtop insertions : 730 0.12/0.38 0.12/0.38 # ------------------------------------------------- 0.12/0.38 # User time : 0.026 s 0.12/0.38 # System time : 0.007 s 0.12/0.38 # Total time : 0.033 s 0.12/0.38 # Maximum resident set size: 1628 pages 0.12/0.38 EOF